Interface Grammars for Modular Software Model Checking
نویسندگان
چکیده
منابع مشابه
Explicit State Model Checking for Graph Grammars
In this paper we present the philosophy behind the GROOVE project, in which graph transformation is used as a modelling formalism on top of which a model checking approach to software verification is being built. We describe the basic formalism, the current state of the project, and (current and future) challenges.
متن کاملDistributed Modular Model Checking
Model checking is a formal method that veri es whether a nite state model of a system satis es a speci cation gi v enas a temporal logic formula. The most severe problem model checking suffer from is the so called state explosion problem. Distribution is one of the techniques that combat the state explosion. The aim is to distribute the state space among a number of computers so as to be able t...
متن کاملTowerds Model Checking Graph Grammars
We sketch a setup in which transition systems are generated from graph grammars and subsequently checked for properties expressed in a temporal logic on graphs. We envisage this as part of an approach where graph grammars are used to express the behavioural semantics of object-oriented programs, thus enabling automatic verification of those programs. This paper describes work in progress.
متن کاملInterface Compatibility Checking for Software Modules
We present a formal methodology and tool for uncovering errors in the interaction of software modules. Our methodology consists of a suite of languages for defining software interfaces, and algorithms for checking interface compatibility. We focus on interfaces that explain the method-call dependencies between software modules. Such an interface makes assumptions about the environment in the fo...
متن کاملThread-Modular Model Checking
We present thread-modular model checking, a novel technique for verifying correctness properties of loosely-coupled multithreaded software systems. Thread-modular model checking verifies each thread separately using an automatically inferred environment assumption that abstracts the possible steps of other threads. Separate verification of each thread yields significant space and time savings. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 2008
ISSN: 0098-5589
DOI: 10.1109/tse.2008.72